monotonicity condition

См. также в других словарях:

• Mechanism design — The Stanley Reiter diagram above illustrates a game of mechanism design. The upper left space Θ depicts the type space and the upper right space X the space of outcomes. The social choice function f(θ) maps a type profile to an outcome. In games… …   Wikipedia

• Nash bargaining game — The Nash bargaining game is a simple two player game used to model bargaining interactions. In the Nash Bargaining Game two players demand a portion of some good (usually some amount of money). If the two proposals sum to no more than the total… …   Wikipedia

• Bargaining Problem — The two person bargaining problem is a problem of understanding how two agents should cooperate when non cooperation leads to Pareto inefficient results. It is in essence an equilibrium selection problem. Many games have multiple equilibria with… …   Wikipedia

• Bargaining problem — The two person bargaining problem is a problem of understanding how two agents should cooperate when non cooperation leads to Pareto inefficient results. It is in essence an equilibrium selection problem; Many games have multiple equilibria with… …   Wikipedia

• Monotonic function — Monotonicity redirects here. For information on monotonicity as it pertains to voting systems, see monotonicity criterion. Monotonic redirects here. For other uses, see Monotone (disambiguation). Figure 1. A monotonically increasing function (it… …   Wikipedia

• Fuzzy set operations — A fuzzy set operation is an operation on fuzzy sets. These operations are generalization of crisp set operations. There is more than one possible generalization. The most widely used operations are called standard fuzzy set operations . There are …   Wikipedia

• Godunov's theorem — Godunov s theorem, also known as Godunov s order barrier theorem, is a mathematical theorem important in the development of the theory of high resolution schemes for the numerical solution of partial differential equations.Professor Sergei K.… …   Wikipedia

• Arrow's impossibility theorem — In social choice theory, Arrow’s impossibility theorem, the General Possibility Theorem, or Arrow’s paradox, states that, when voters have three or more distinct alternatives (options), no voting system can convert the ranked preferences of… …   Wikipedia

• Galois connection — In mathematics, especially in order theory, a Galois connection is a particular correspondence between two partially ordered sets (posets). Galois connections generalize the correspondence between subgroups and subfields investigated in Galois… …   Wikipedia

• Dominated convergence theorem — In measure theory, Lebesgue s dominated convergence theorem provides sufficient conditions under which two limit processes commute, namely Lebesgue integration and almost everywhere convergence of a sequence of functions. The dominated… …   Wikipedia

• Hartley function — The Hartley function is a measure of uncertainty, introduced by Ralph Hartley in 1928. If we pick a sample from a finite set A uniformly at random, the information revealed after we know the outcome is given by the Hartley function If the base of …   Wikipedia